ON THE MINIMAL FREE RESOLUTION OF n + 1 GENERAL FORMS
نویسندگان
چکیده
Let R = k[x 1 ,. .. , xn] and let I be the ideal of n + 1 generically chosen forms of degrees d 1 ≤ · · · ≤ d n+1. We give the precise graded Betti numbers of R/I in the following cases: • n = 3; • n = 4 and 5 i=1 d i is even; • n = 4, 5 i=1 d i is odd and d 2 + d 3 + d 4 < d 1 + d 5 + 4; • n is even and all generators have the same degree, a, which is even; • (n+1 i=1 d i) − n is even and d 2 + · · · + dn < d 1 + d n+1 + n; • (n+1 i=1 d i) − n is odd, n ≥ 6 is even, d 2 + · · · + dn < d 1 + d n+1 + n and d 1 + · · · + dn − d n+1 − n 0. We give very good bounds on the graded Betti numbers in many other cases. We also extend a result of M. Boij by giving the graded Betti numbers for a generic compressed Gorenstein algebra (i.e., one for which the Hilbert function is maximal, given n and the socle degree) when n is even and the socle degree is large. A recurring theme is to examine when and why the minimal free resolution may be forced to have redundant summands. We conjecture that if the forms all have the same degree, then there are no redundant summands, and we present some evidence for this conjecture.
منابع مشابه
On a special class of Stanley-Reisner ideals
For an $n$-gon with vertices at points $1,2,cdots,n$, the Betti numbers of its suspension, the simplicial complex that involves two more vertices $n+1$ and $n+2$, is known. In this paper, with a constructive and simple proof, wegeneralize this result to find the minimal free resolution and Betti numbers of the $S$-module $S/I$ where $S=K[x_{1},cdots, x_{n}]$ and $I$ is the associated ideal to ...
متن کاملIdeal of Lattice homomorphisms corresponding to the products of two arbitrary lattices and the lattice [2]
Abstract. Let L and M be two finite lattices. The ideal J(L,M) is a monomial ideal in a specific polynomial ring and whose minimal monomial generators correspond to lattice homomorphisms ϕ: L→M. This ideal is called the ideal of lattice homomorphism. In this paper, we study J(L,M) in the case that L is the product of two lattices L_1 and L_2 and M is the chain [2]. We first characterize the set...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملIdeals of General Forms and the Ubiquity of the Weak Lefschetz Property
Let d1, . . . , dr be positive integers and let I = (F1, . . . , Fr) be an ideal generated by forms of degrees d1, . . . , dr, respectively, in a polynomial ring R with n variables. With no further information virtually nothing can be said about I, even if we add the assumption that R/I is Artinian. Our first object of study is the case where the Fi are chosen generally, subject only to the deg...
متن کامل